|
In cryptography, the anonymous veto network (or AV-net) is a multi-party secure computation protocol to compute the boolean-OR function.〔F. Hao, P. Zieliński. (A 2-round anonymous veto protocol ). ''Proceedings of the 14th International Workshop on Security Protocols, 2006.〕 It presents an efficient solution to the Dining cryptographers problem. ==Description== All participants agree on a group with a generator of prime order in which the discrete logarithm problem is hard. For example, a Schnorr group can be used. For a group of participants, the protocol executes in two rounds. Round 1: each participant selects a random value and publishes the ephemeral public key together with a zero-knowledge proof for the proof of the exponent . A detailed description of a method for such proofs is found in the article Fiat-Shamir heuristic. After this round, each participant computes: : Round 2: each participant publishes and a zero-knowledge proof for the proof of the exponent . Here, the participants chose if they want to send a "0" bit (no veto), or a random value if they want to send a "1" bit (veto). After round 2, each participant computes . If no one vetoed, each will obtain . On the other hand, if one or more participants vetoed, each will have . 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Anonymous veto network」の詳細全文を読む スポンサード リンク
|